Simplified methods for next generation IP access networks planning

The scope of this paper is to derive a set of simple formulas providing a traffic aggregation in important points of an Internet access networks. The paper shows that the resources associated to the access network depend on user type-, technology and service parameter. Existing calculation methodologies applies on individual approximations whereas this proposal exposes the combined application of these individual and wellknown approximations providing a scheme of generic dimensioning formulas. The dimensioning formulas for a generic applications are derived for the three main levels: connection, session and burst level, and the traffic aggregation is considered through three different and combined variables describing users, accesses and services forming a cube with three axes. The adaptation of corresponding parameters following the different axes allows the calculation of complete access network traffic scenarios, grouped by the so called CASUAL concept: Cube of Accesses / Services / Users. A set of CASUAL based tools allows an estimation of the aggregated traffic in different access points as multiplexers, IP point of presence or edge routers

Socio-economic issues in future generation internet

Socio-Economic Issues in Future Generation Interne

Approximation to a behavioral model for estimating traffic aggregation scenarios

This article provides a comparison among different methods for estimating the aggregation of Internet traffic resulting from different users, network-access types and corresponding services. Some approximate models usually used as isolated methods are combined with a temporally scaled ON-OFF model with binomial approximations. The aggregation problem is solved using a new form of parameterization based on the composition of the source traffic accordingly to the concrete characteristics of the users, the accesses and the services. This is a new concept, called CASUAL, included within an overall network planning methodology for the design and dimensioning of Next Generation Internet

Cost model for bitstream access services with QoS parameters

The European Regulator Group (ERG) defines Bitstream Access Service as a wholesale service offered by a broadband network operator with significant market power to an Internet Service Provider, and identifies it as a market subject to regulation. This paper develops a cost model for the Bitstream Access Service under xDSL technology, following the recommendations of the ERG, considering different user classes with differentiated QoS requirements. For this purpose, three traffic engineering methods are analysed: separate virtual tunnels, over-engineering and priority queuing technique

Bottom-up cost modelling for bitstream services in broadband access networks

This contribution provides a definition of Bitstream Access Services and shows its importance inside the European Regulation. For this purpose a traffic model for the bitstream services is developed and a network structure for the corresponding broadband access network is determined. Additionally the contribution provides a model for a cost optimal Network planning and dimensioning and indicates a corresponding tool implementation. The cost model to be applied is exposed and applied to a network example. Additionally some problems arising for QoS differentiation in providing bitstream access services are shown and a first approach is indicated

A genetic algorithm for solving the first price sealed bid auction in communication networks

This paper shows the first result obtained in the application of economic mechanisms for the efficient assignment of resources in communication networks. The final objective is to determine which Service Provider will carry their traffic over the network of a Network Provider, which will be the most profitable route and which price the ISPs will pay for it to the Network provider. As the price is a key driver a good approach to select the ISP may be an auction mechanism. The implementation of these kind of auction mechanisms becomes a NP complete problem which is solved in this paper using novel metaheuristics, specifically a genetic algorithm

Simulation of the behavior of bidders in first-price sealed-bid auctions on communication networks

Auction mechanisms have arisen as very efficient methods for scarce resource allocations. For this reason there is a current research topic based on the application of these economics mechanisms to the design of communication networks, mainly in the provision of QoS to new multimedia services. The main research works are oriented to the assignment and pricing rules, that is, the network resource assigned to the user (the bandwidth on a link, or the route of a traffic demand) and the amount of money it is going to cost to him respectively. However, as far as we know, there is a little research focused in the analysis of the behaviour of the user. Note that an auction is in fact a competition where the user will behave selfishly in order to obtain the greater profit. In this paper we present the first results of a simulator which analyzes the behaviour of the user in an auction over a communication link. They obtain the revenue of the auctioneer that is the network provider, and the resource allocation under different schemes of user behaviour, from a very conservative character up to most risky behaviours

Modelo analítico para el dimensionado de la RPT/RDSI con tráfico de voz y acceso a Internet

Internet access through the public switched telephone network, PSTN/ISDN, produces changes in the characteristics of traffic managed by this kind of networks. Under this situation, traditional network dimensioning using Erlang model results excessively optimistic. This article develops a simple model to approach traditional methods to current PSTN/ISDN traffic features including the effect of call repetition. The analytical model obtained for traffic dimensioning is validated with simulation models, and have been integrated in tools for design and dimensioning of PSTN/ISDN networks

Novel heuristics for cell radius determination in WCDMA systems and their application to strategic planning studies

We propose and compare three novel heuristics for the calculation of the optimal cell radius in mobile networks based on Wideband Code Division Multiple Access (WCDMA) technology. The proposed heuristics solve the problem of the load assignment and cellular radius calculation. We have tested our approaches with experiments in multiservices scenarios showing that the proposed heuristics maximize the cell radius, providing the optimum load factor assignment. The main application of these algorithms is strategic planning studies, where an estimation of the number of Nodes B of the mobile operator, at a national level, is required for economic analysis. In this case due to the large number of different scenarios considered (cities, towns, and open areas) other methods than simulation need to be considered. As far as we know, there is no other similar method in the literature and therefore these heuristics may represent a novelty in strategic network planning studies. The proposed heuristics are implemented in a strategic planning software tool and an example of their application for a case in Spain is presented. The proposed heuristics are used for telecommunications regulatory studies in several countries

Desarrollo de un simulador celular a nivel de llamada para WCDMA

This article deals with the development of a cell simulator for WCDMA systems. The objective of this tool is to test the results of different algorithms for the cell radius calculation. This simulation tool is conceived on a call/connection level rather than on a packet level. This means that each user connection is considered as a single event independently of the type of service. The article also shows an independent tool for the cell radius calculation which results over different service scenarios are tested with the simulator. Finally the future enhancements of the simulator are presented